On the Structure of Digraphs with Order Close to the Moore Bound
نویسندگان
چکیده
The Moore bound for a diregular digraph of degree d and diameter k is Md k d d It is known that digraphs of order Md k do not exist for d and k or In this paper we study digraphs of degree d diameter k and order Md k denoted by d k digraphs Miller and Fris showed that k digraphs do not exist for k Subsequently we gave a necessary condition of the existence of k digraphs namely k digraphs do not exist if k is odd or if k does not divide k The d digraphs were considered in In this paper we present further necessary conditions for the existence of d k digraphs In particular for d k we show that a d k digraph contains either no cycle of length k or exactly one cycle of length k
منابع مشابه
Regular digraphs of diameter 2 and maximum order
It is known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist (see [16] or [4]). For degree 2, it has been shown that for diameter k ~ 3 there are no digraphs of order 'close' to, i.e., one less than, the Moore bound (14). For diameter 2, it is known that digraphs close to Moore bound exist for any degree because the line digraphs of complete digraphs are an example of such di...
متن کاملDigraphs of degree 3 and order close to the moore bound
It is known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist (see 20] or 5]). Furthermore, for degree 2, it is shown that for k 3 there are no digraphs of order`close' to, i.e., one less than, Moore bound 18]. In this paper, we shall consider digraphs of diameter k, degree 3 and number of vertices one less than Moore bound. We give a necessary condition for the existence of s...
متن کاملDigraphs of degree and order close to the Moore bound
It is known that Moore digraphs of degree d and diameter k do not ex ist see or Furthermore for degree it is shown that for k there are no digraphs of order close to i e one less than Moore bound In this paper we shall consider digraphs of diameter k degree and number of vertices one less than Moore bound We give a necessary condition for the existence of such digraphs and using this condition ...
متن کاملFurther results on almost Moore digraphs
The nonexistence of digraphs with order equal to the Moore bound Md;k = 1+d+: : :+d k for d; k > 1 has lead to the study of the problem of the existence ofàlmost' Moore digraphs, namely digraphs with order close to the Moore bound. In 1], it was shown that almost Moore digraphs of order Md;k ? 1, degree d, diameter k (d; k 3) contain either no cycle of length k or exactly one such cycle. In thi...
متن کاملOn diregularity of digraphs of defect two
Since Moore digraphs do not exist for k 6= 1 and d 6= 1, the problem of finding the existence of digraph of out-degree d ≥ 2 and diameter k ≥ 2 and order close to the Moore bound becomes an interesting problem. To prove the non-existence of such digraphs, we first may wish to establish their diregularity. It is easy to show that any digraph with out-degree at most d ≥ 2, diameter k ≥ 2 and orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 14 شماره
صفحات -
تاریخ انتشار 1998